//
//  main.c
//  Tree Decomposition
//
//  Created by Benoît Vanalderweireldt on 04/05/12.
//  Copyright (c) 2012 Sofware Project. All rights reserved.
//

#include <stdio.h>
#include <stdlib.h>
#include "listVertices.h"
#include "vertice.h"


int main(int argc, const char * argv[])
{
    struct vertice * v = (vertice *)malloc(sizeof (vertice) );
    v->name=2;
    v->neighbors=NULL;
    
    vertices list = (vertices)malloc(sizeof (vertices) );
    list->nxt=NULL;
    list->v=NULL;
    
    //list = addFirst(list, *v);
    
    list = addLast(list, *v);
    
    
    
    linkVertices* temp=list;
    while(temp->v!=NULL)
    {
        printf("%d\n", temp->v->name);
        if (temp->nxt != NULL) {
            temp = temp->nxt;
        }
        else {
            break;
        }
    }
    
    //printf("%d\n", list->v->name);
    
    return 0;
}

